Root Isolation of Zero-dimensional Polynomial Systems with Linear Univariate Representation
نویسندگان
چکیده
In this paper, a linear univariate representation for the roots of a zero-dimensional polynomial equation system is presented, where the roots of the equation system are represented as linear combinations of roots of several univariate polynomial equations. The main advantage of this representation is that the precision of the roots can be easily controlled. In fact, based on the linear univariate representation, we can give the exact precisions needed for isolating the roots of the univariate equations in order to obtain the roots of the equation system to a given precision. As a consequence, a root isolation algorithm for a zero-dimensional polynomial equation system can be easily derived from its linear univariate representation.
منابع مشابه
A Generic Position Based Method for Real Root Isolation of Zero-Dimensional Polynomial Systems
We improve the local generic position method for isolating the real roots of a zero-dimensional bivariate polynomial system with two polynomials and extend the method to general zerodimensional polynomial systems. The method mainly involves resultant computation and real root isolation of univariate polynomial equations. The roots of the system have a linear univariate representation. The compl...
متن کاملIntersection Formulas and Algorithms for Computing Triangular Decompositions
Methods for computing triangular decompositions of polynomial systems can be classified into two groups. First, those computing a series of regular chains C1 . . . , Ce such that for each irreducible component V of the variety of the input system, one of the Ci’s encodes a generic zero of V . An example is the algorithm of Michael Kalkbrener in his PhD thesis. Secondly are those methods computi...
متن کاملOn Representations of Algebraic-Geometric Codes
We show that all algebraic-geometric codes possess a succinct representation that allows for the list decoding algorithms of [9, 6] to run in polynomial time. We do this by presenting a root-finding algorithm for univariate polynomials over function fields when their coefficients lie in finite-dimensional linear spaces, and proving that there is a polynomial size representation given which the ...
متن کاملOn Representations of Algebraic-Geometric Codes for List Decoding
We show that all algebraic-geometric codes possess a succinct representation that allows for the list decoding algorithms of [15, 7] to run in polynomial time. We do this by presenting a root-finding algorithm for univariate polynomials over function fields when their coefficients lie in finite-dimensional linear spaces, and proving that there is a polynomial size representation given which the...
متن کاملOn representations of algebraic-geometry codes
We show that all algebraic-geometric codes possess a succinct representation that allows for the list decoding algorithms of 9, 6] to run in polynomial time. We do this by presenting a root-nding algorithm for univariate polynomials over function elds when their coeecients lie in nite-dimensional linear spaces, and proving that there is a polynomial size representation given which the root ndin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 47 شماره
صفحات -
تاریخ انتشار 2012